A comparative analysis of algorithms for fast computation of Zernike moments

This paper details a comparative analysis on time taken by the present and proposed methods to compute the Zernike moments, Zpq. The present method comprises of Direct, Belkasim’s, Prata’s, Kintner’s and Coe3cient methods. We propose a new technique, denoted as q-recursive method, speci5cally for fast computation of Zernike moments. It uses radial polynomials of 5xed order p with a varying index q to compute Zernike moments. Fast computation is achieved because it uses polynomials of higher index q to derive the polynomials of lower index q and it does not use any factorial terms. Individual order of moments can be calculated independently without employing loweror higher-order moments. This is especially useful in cases where only selected orders of Zernike moments are needed as pattern features. The performance of the present and proposed methods are experimentally analyzed by calculating Zernike moments of orders 0 to p and speci5c order p using binary and grayscale images. In both the cases, the q-recursive method takes the shortest time to compute Zernike moments. ? 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.